Well-Definedness of Streams by Termination
نویسنده
چکیده
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream specification to a TRS in such a way that termination of the resulting TRS implies that the stream specification admits a unique solution. As a consequence, proving such well-definedness of several interesting stream specifications can be done fully automatically using present powerful tools for proving TRS termination.
منابع مشابه
Well-definedness of Streams by Transformation and Termination
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream specification to a term rewriting system (TRS) in such a way that termination of the resulting TRS implies that the stream specification is well-defined, that is, admits a unique solution. As a consequence, proving well-d...
متن کاملA Tool Proving Well-Definedness of Streams Using Termination Tools
A stream specification is a set of equations intended to define a stream, that is, an infinite sequence over a given data type. In [5] a transformation from such a stream specification to a TRS is defined in such a way that termination of the resulting TRS implies that the stream specification admits a unique solution. In this tool description we present how proving such well-definedness of sev...
متن کاملProving Equality of Streams Automatically
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. In this paper we focus on equality of streams, more precisely, for a given set of equations two stream terms are said to be equal if they are equal in every model satisfying the given equations. We investigate techniques for proving equality of streams suitable for au...
متن کاملMonotonicity Criteria for Polynomial Interpretations over the Naturals
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomials whose coefficients (i.e., the parameters) are initially unknown and have to be instantiated suitably such that the resulting concrete polynomials satisfy certain conditions. We focus on monotonicity and well-defin...
متن کاملStringy Hodge Numbers and P-adic Hodge Theory
Stringy Hodge numbers are introduced by Batyrev for a mathematical formulation of mirror symmetry. However, since the stringy Hodge numbers of an algebraic variety are defined by choosing a resolution of singularities, the well-definedness is not clear from the definition. Batyrev proved the well-definedness by using the theory of motivic integration developed by Kontsevich, Denef-Loeser. The a...
متن کامل